複雑さに関連した特徴を用いた主観的印象予測

学位の種別: 課程博士審査委員会委員 : （主査）東京大学准教授 山﨑 俊彦, 東京大学教授 相澤 清晴, 国立情報学研究所教授 佐藤 真一, 東京大学教授 佐藤 洋一, 東京大学教授 苗村 健University of Tokyo(東京大学

SkyFinder: Attribute-based Sky Image Search

Sky search results by specifying a set of semantic attributes (category (blue-sky/cloudy-sky/sunset) + layout (landscape/normalsky/full-sky/object-in-sky/others) + horizon height + sun position + richness (R1 ∼ R5)) in our search system. Abstract. In this paper, we present SkyFinder, an interactive search system of over a half million sky images downloaded from the Internet. Using a set of automatically extracted, semantic sky attributes (category, layout, richness, horizon, etc.), the user can find a desired sky image, such as “a landscape with rich clouds at sunset” or “a whole blue sky with white clouds”. The system is fully automatic and scalable. It computes all sky attributes offline, then provides an interactive online search engine. Moreover, we build a sky graph based on the sky attributes, so that the user can smoothly explore and find a path within the space of skies. We also show how our system can be used for controllable sky replacement.

The Verification of PLC Program Based on Interactive Theorem Proving Tool COQ

International audienceCOQ is an interactive theorem proving tool. The paper abstractly describes the feature of COQ, the architecture and working modes of PLC program with the example of typical PLC. It also introduces the first-order logic syntax and semantics of Intuitionistic Logic. It briefly introduces the main Gallina language syntax elements, the corresponding use methods and main theorem proving tactic on COQ. The work has modeled kernel data type and basic statements and and the denotational semantics of PLC program with Gallina. It has given the correctness proof of PLC program based on theorem proving, i.e. based on semantics function the relationship of configuration between the before codes execution and the after is proved. The main purpose is to prove whether a PLC program satisfies certain nature within a scan period

A Formal Definition Method of Denotational Semantics and Functions for PLC Program Language

National audienceThe correctness verification methods of PLC programs include software model checking and theorem proving, etc. The paper studies the definition of denotational semantics on PLC program language, which is convenient to PLC programs modeling and model checking. The purpose of work is the correctness verification on PLC programs by formal methods. Based on the extended λ-calculus definition, the paper has defined the configuration of PLC program architecture, denotational semantics of PLC programs and functions of denotational semantics. It is the basis of model checking and theorem proving

The Verification of PLC Program Based on Interactive Theorem Proving Tool COQ

International audienceCOQ is an interactive theorem proving tool. The paper abstractly describes the feature of COQ, the architecture and working modes of PLC program with the example of typical PLC. It also introduces the first-order logic syntax and semantics of Intuitionistic Logic. It briefly introduces the main Gallina language syntax elements, the corresponding use methods and main theorem proving tactic on COQ. The work has modeled kernel data type and basic statements and and the denotational semantics of PLC program with Gallina. It has given the correctness proof of PLC program based on theorem proving, i.e. based on semantics function the relationship of configuration between the before codes execution and the after is proved. The main purpose is to prove whether a PLC program satisfies certain nature within a scan period

The Denotational Semantics Definition of PLC Programs Based on Extended λ-Calculus

International audiencePLC is widely used in the field of automatic control. The correctness verification methods of PLC programs include software model checking and theorem proving, etc. To use formal methods verifying the correctness of PLC programs, denotational semantics needs to define and then PLC programs can be modeled, model checking and verified. Based on the extended λ-calculus definition, the paper has researched and defined the architecture and denotational semantics of PLC programs. The work is the basis of model checking and theorem proving for correctness verification on PLC programs

Refractory high-entropy alloys fabricated using laser technologies: a concrete review

Refractory high-entropy alloys (RHEAs) have attracted widespread attention in recent years as multi-component alloys applied to high-temperature fields. High melting point elements endow special microstructures and properties to RHEAs, which differ from those of conventional alloys and pose a challenge to conventional fabricating technologies. Laser fabrication technologies are attractive in fabricating RHEAs since a high-power density laser beam can be used as a controllable heat source to quickly melt refractory elements and then followed by rapid cooling and solidification to optimize the dependent properties. This paper reviews recent research progress in the fabricating process and the influence of processing on microstructural evolution and phase formation of laser-fabricated RHEAs, aiming to address the use of laser technologies for improving room temperature and high-temperature properties of RHEAs, thereby providing a reference for research community. The current methods of laser fabricating RHEAs, namely selective laser melting, laser metal deposition and laser cladding, are first introduced, and then the relationships between chemical composition, microstructure and properties of RHEAs are analyzed from experimental and simulation perspectives. In addition, the microhardness, oxidation resistance, wear resistance, corrosion resistance, irradiation resistance, and biocompatibility of laser fabricated RHEAs are discussed. Finally, the critical challenges and opportunities for laser fabricating RHEAs in the research field are highlighted, based on the research perspective of this topic

Salient object detection by composition

Conventional saliency analysis methods measure the saliency of individual pixels. The resulting saliency map inevitably loses information in the original image and finding salient objects in it is difficult. We propose to detect salient objects by directly measuring the saliency of an image window in the original image and adopt the well established sliding window based object detection paradigm. We present a simple definition for window saliency, i.e., the cost of composing the window using the remaining parts of the image. The definition uses the entire image as the context and agrees with human intuition. It no longer relies on idealistic assumptions usually used before (e.g., “background is homogenous”) and generalizes well to complex objects and backgrounds in real world images. To realize the definition, we illustrate how to incorporate different cues such as appearance, position, and size. Based on a segment-based representation, the window composition cost function can be efficiently evaluated by a greedy optimization algorithm. Extensive evaluation on challenging object detection datasets verifies better efficacy and efficiency of the proposed method comparing to the state-of-the-art, making it a good pre-processing tool for subsequent applications. Moreover, we hope to stimulate further work towards the challenging yet important problem of generic salient object detection. 1